546 research outputs found
Graphical representations of graphic frame matroids
A frame matroid M is graphic if there is a graph G with cycle matroid
isomorphic to M. In general, if there is one such graph, there will be many.
Zaslavsky has shown that frame matroids are precisely those having a
representation as a biased graph; this class includes graphic matroids,
bicircular matroids, and Dowling geometries. Whitney characterized which graphs
have isomorphic cycle matroids, and Matthews characterised which graphs have
isomorphic graphic bicircular matroids. In this paper, we give a
characterization of which biased graphs give rise to isomorphic graphic frame
matroids
Tree automata and pigeonhole classes of matroids -- II
Let be a sentence in the counting monadic second-order logic of
matroids. Let F be a finite field. Hlineny's Theorem says there is a
fixed-parameter tractable algorithm for testing whether F-representable
matroids satisfy , with respect to the parameter of branch-width. In a
previous paper we proved there is a similar fixed-parameter tractable algorithm
for any efficiently pigeonhole class. In this sequel we apply results from the
first paper and thereby extend Hlineny's Theorem to the classes of fundamental
transversal matroids, lattice path matroids, bicircular matroids, and
H-gain-graphic matroids, when H is a finite group. As a consequence, we can
obtain a new proof of Courcelle's Theorem.Comment: Extending the main theorem slightly to cover a more expressive logi
Tree automata and pigeonhole classes of matroids -- I
Hlineny's Theorem shows that any sentence in the monadic second-order logic
of matroids can be tested in polynomial time, when the input is limited to a
class of F-representable matroids with bounded branch-width (where F is a
finite field). If each matroid in a class can be decomposed by a subcubic tree
in such a way that only a bounded amount of information flows across displayed
separations, then the class has bounded decomposition-width. We introduce the
pigeonhole property for classes of matroids: if every subclass with bounded
branch-width also has bounded decomposition-width, then the class is
pigeonhole. An efficiently pigeonhole class has a stronger property, involving
an efficiently-computable equivalence relation on subsets of the ground set. We
show that Hlineny's Theorem extends to any efficiently pigeonhole class. In a
sequel paper, we use these ideas to extend Hlineny's Theorem to the classes of
fundamental transversal matroids, lattice path matroids, bicircular matroids,
and H-gain-graphic matroids, where H is any finite group. We also give a
characterisation of the families of hypergraphs that can be described via tree
automata: a family is defined by a tree automaton if and only if it has bounded
decomposition-width. Furthermore, we show that if a class of matroids has the
pigeonhole property, and can be defined in monadic second-order logic, then any
subclass with bounded branch-width has a decidable monadic second-order theory.Comment: Slightly extending the main theorem to cover a more expressive logi
Describing Quasi-Graphic Matroids
The class of quasi-graphic matroids recently introduced by Geelen, Gerards,
and Whittle generalises each of the classes of frame matroids and
lifted-graphic matroids introduced earlier by Zaslavsky. For each biased graph
Zaslavsky defined a unique lift matroid
and a unique frame matroid , each on ground set . We
show that in general there may be many quasi-graphic matroids on and
describe them all. We provide cryptomorphic descriptions in terms of subgraphs
corresponding to circuits, cocircuits, independent sets, and bases. Equipped
with these descriptions, we prove some results about quasi-graphic matroids. In
particular, we provide alternate proofs that do not require 3-connectivity of
two results of Geelen, Gerards, and Whittle for 3-connected matroids from their
introductory paper: namely, that every quasi-graphic matroid linearly
representable over a field is either lifted-graphic or frame, and that if a
matroid has a framework with a loop that is not a loop of then is
either lifted-graphic or frame. We also provide sufficient conditions for a
quasi-graphic matroid to have a unique framework.
Zaslavsky has asked for those matroids whose independent sets are contained
in the collection of independent sets of while containing
those of , for some biased graph . Adding a
natural (and necessary) non-degeneracy condition defines a class of matroids,
which we call biased graphic. We show that the class of biased graphic matroids
almost coincides with the class of quasi-graphic matroids: every quasi-graphic
matroid is biased graphic, and if is a biased graphic matroid that is not
quasi-graphic then is a 2-sum of a frame matroid with one or more
lifted-graphic matroids
Defining bicircular matroids in monadic logic
We conjecture that the class of frame matroids can be characterised by a
sentence in the monadic second-order logic of matroids, and we prove that there
is such a characterisation for the class of bicircular matroids. The proof does
not depend on an excluded-minor characterisation
There are only a finite number of excluded minors for the class of bicircular matroids
We show that the class of bicircular matroids has only a finite number of
excluded minors. Key tools used in our proof include representations of
matroids by biased graphs and the recently introduced class of quasi-graphic
matroids. We show that if is an excluded minor of rank at least ten, then
is quasi-graphic. Several small excluded minors are quasi-graphic. Using
biased-graphic representations, we find that already contains one of these.
We also provide an upper bound, in terms of rank, on the number of elements in
an excluded minor, so the result follows.Comment: Added an appendix describing all known excluded minors. Added Gordon
Royle as author. Some proofs revised and correcte
Short rainbow cycles in graphs and matroids
Let be a simple -vertex graph and be a colouring of with
colours, where each colour class has size at least . We prove that
contains a rainbow cycle of length at most ,
which is best possible. Our result settles a special case of a strengthening of
the Caccetta-H\"aggkvist conjecture, due to Aharoni. We also show that the
matroid generalization of our main result also holds for cographic matroids,
but fails for binary matroids.Comment: 9 pages, 2 figure
- …